An Efficient Approach to Solve Sudoku Problem by Harmony Search Algorithm
نویسندگان
چکیده
Harmony Search Algorithm originally came from the analogy between the music improvisation and optimization process. The harmony search algorithm is searching the optimal solution using the novel stochastic derivative equation. The equation is based on density information of multiple solution vectors, instead of calculus based gradient information of single solution vector. In other words, if a certain value frequently appears in multiple vectors, then the value has higher chance to be selected rather than the other candidate values. In this paper, an algorithm has been proposed to solve the Sudoku problem based on harmony search. A comparative study has been made with the proposed algorithm with the existing solution of Sudoku problem by harmony search. It has been proved that the proposed algorithm minimized the iterations to solve the Sudoku problem.
منابع مشابه
Using a new modified harmony search algorithm to solve multi-objective reactive power dispatch in deterministic and stochastic models
The optimal reactive power dispatch (ORPD) is a very important problem aspect of power system planning and is a highly nonlinear, non-convex optimization problem because consist of both continuous and discrete control variables. Since the power system has inherent uncertainty, hereby, this paper presents both of the deterministic and stochastic models for ORPD problem in multi objective and sin...
متن کاملPresenting a Joint Replenishment-location Model Under all-units Quantity Discount and Solving by Genetic Algorithm and Harmony Search Algorithm
In this paper a model is proposed for distribution centers location and joint replenishment of a distribution system that is responsible for orders and product delivery to distribution centers. This distribution centers are under limitedwarehouse space and this can determine amount of requirement product by considering proposed discount.The proposed model is develop to minimize total costs cons...
متن کاملFinding solutions to sudoku puzzles using human intuitive heuristics
Sudoku is a logical puzzle that has achieved international popularity. Given this, there have been a number of computer solvers developed for this puzzle. Various methods including genetic algorithms, simulated annealing, particle swarm optimization and harmony search have been evaluated for this purpose. The approach described in this paper combines human intuition and optimization to solve Su...
متن کاملA New model for integrated lot sizing and scheduling in flexible job shop problem
In this paper an integrated lot-sizing and scheduling problem in a flexible job shop environment with machine-capacity-constraint is studied. The main objective is to minimize the total cost which includes the inventory costs, production costs and the costs of machine’s idle times. First, a new mixed integer programming model,with small bucket time approach,based onProportional Lot sizing and S...
متن کاملA stochastic network design of bulky waste recycling – a hybrid harmony search approach based on sample approximation
Facing supply uncertainty of bulky wastes, the capacitated multi-product stochastic network design model for bulky waste recycling is proposed in this paper. The objective of this model is to minimize the first-stage total fixed costs and the expected value of the second-stage variable costs. The possibility of operation costs and transportation costs for bulky waste recycling is considered ...
متن کامل